منابع مشابه
Top-down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars
This paper introduces a machinery called attributed top-down parsing automaton which performs top{down parsing of strings and, simultaneously, the evaluation of arbitrary noncircular attribute grammars. The strategy of the machinery is based on a single depth{ rst left{to{right traversal over the syntax tree. There is no need to traverse parts of the syntax tree more than once, and hence, the s...
متن کاملMemoization in Top-Down Parsing
In a paper published in this journal, Norvig (1991) pointed out that memoization of a top-down recognizer program produces a program that behaves similiarly to a chart parser. This is not surprising to anyone familiar with logic-programming approaches to natural language processing (NLP). For example, the Earley deduction proof procedure is essentially a memoizing version of the top-down select...
متن کاملMemoization of Top Down Parsing
In a paper published in this journal, Norvig (1991) pointed out that memoization of a topdown recognizer program produces a program that behaves similiarly to a chart parser. This is not surprising to anyone familiar with logic-programming approaches to NLP. For example, the Earley deduction proof procedure is essentially a memoizing version of the top-down SLD proof procedure employed by Prolo...
متن کاملTesting Grammars For Top-Down Parsers
According to the software engineering perspective, grammars can be viewed as “Specifications for defining languages or compilers”. They form the basics of languages and several important kinds of software rely on grammars; e.g. compilers and parsers, debuggers, code processing tools, software modification tools, and software analysis tools. Testing a grammar to make sure that it is correct and ...
متن کاملResearch on the Top-Down Parsing Method for Context-Sensitive Graph Grammars
The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply. In order to reduce the time-complexity, this paper uses the top-down method for parsing. This method avoids the subgraph isomorphism judgment and selects the productions specifically, so that the time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1979
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(79)90362-0